Characterizations of the differential uniformity of vectorial functions by the Walsh transform
نویسنده
چکیده
For every positive integers n, m and every even positive integer δ, we derive inequalities satisfied by the Walsh transforms of all vectorial (n,m)-functions and prove that the case of equality characterizes differential δ-uniformity. This provides a generalization to all differentially δ-uniform functions of the characterization of APN (n, n)-functions due to Chabaud and Vaudenay, by means of the fourth moment of the Walsh transform. Such generalization has been missing since the introduction of the notion of differential uniformity by Nyberg in 1994 and since Chabaud-Vaudenay’s result the same year. For each even δ ≥ 2, we find several such characterizations. In particular, when δ = 2 and δ = 4, we have that, for any (n, n)-function (resp. any (n, n − 1)-function), the arithmetic mean of W 2 F (u1, v1)W 2 F (u2, v2)W 2 F (u1 + u2, v1 + v2) when u1, u2 range independently over F2 and v1, v2 are nonzero and distinct and range independently over F2 , is at least 2, and that F is APN (resp. is differentially 4-uniform) if and only if this arithmetic mean equals 2 (which is the value we would get with a bent function if such function could exist). These inequalities give more knowledge on the Walsh spectrum of (n,m)-functions. We deduce in particular a property of the Walsh support of highly nonlinear functions. We also consider the completely open question of knowing if the nonlinearity of APN functions is necessarily non-weak (as it is the case for known APN functions); we prove new lower bounds which cover all power APN functions (and hence a large part of known APN functions), which explain why their nonlinearities are rather good, and we discuss the question of the nonlinearity of APN quadratic functions (since almost all other known APN functions are quadratic).
منابع مشابه
Componentwise APNness, Walsh uniformity of APN functions and cyclic-additive difference sets
In the preprint [Characterizations of the differential uniformity of vectorial functions by the Walsh transform, IACR ePrint Archive 2017/516], the author has, for each even positive δ, characterized in several ways differentially δ-uniform functions by equalities satisfied by their Walsh transforms. These characterizations generalize the well-known characterization of APN functions by the four...
متن کاملResults on Characterizations of Plateaued Functions in Arbitrary Characteristic
Bent and plateaued functions play a significant role in cryptography since they can have various desirable cryptographic properties. In this work, we first provide the characterizations of plateaued functions in terms of the moments of their Walsh transforms. Next, we generalize the characterizations of Boolean bent and plateaued functions in terms of their second-order derivatives to arbitrary...
متن کاملCharacterizations of o-polynomials by the Walsh transform
Abstract. The notion of o-polynomial comes from finite projective geometry. In 2011 and later, it has been shown that those objects play an important role in symmetric cryptography and coding theory to design bent Boolean functions, bent vectorial Boolean functions, semi-bent functions and to construct good linear codes. In this note, we characterize o-polynomials by the Walsh transform of the ...
متن کاملFurther Characterization of H Vectorial Functions
Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis. H vectorial functions is an infinite class of vectorial Boolean bent functions presented by S. Mesnager. This paper is devoted to further characterization of the H vectorial functions. It i...
متن کاملUsing evolutionary computation to create vectorial Boolean functions with low differential uniformity and high nonlinearity
The two most important criteria for vectorial Boolean functions used as S-boxes in block ci-phers are differential uniformity and nonlinearity. Previous work in this field has focused onlyon nonlinearity and a different criterion, autocorrelation. In this paper, we describe the resultsof experiments in using simulated annealing, memetic algorithms, and ant colony optimisation to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017